Strategic Reasoning in Digital Zero-Sum Games (Doctoral Consortium)
نویسندگان
چکیده
Digital zero-sum games are a challenging domain for artificial intelligence techniques. In such games, human players often resort to strategies, i.e., memorized sequences of lowlevel actions that guide their behavior. In this research we model this way of playing by introducing the algorithm selection metagame, in which agents select algorithms to perform low-level game actions on their behalf. The metagame provides a formal basis for algorithm selection in adversarial settings, presenting a simplified representation for complex games. We instantiate it upon realtime strategy game StarCraft, being able to discuss gametheoretic concepts in the resulting abstract representation, as well as generating a game-playing agent that successfully learns how to select algorithms in AI tournaments.
منابع مشابه
Representing and Reasoning about Game Strategies (Doctoral Consortium)
This paper states the challenges for modeling and reasoning strategic behaviour of agents in multi-agent systems. After a brief review of logical analysis of games, we specify the problem we are tackling, and then briefly outline our research plan, the results we have achieved to date as well as the ongoing directions.
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملStrategic reasoning in compositional games
The central innovation introduced by game theory is its strategic dimension. A player’s environment is not neutral, and she expects that other players will try to out-guess her plans. Reasoning about such expectations and strategizing one’s own response accordingly constitutes the main logical challenge of game theory. Evaluation games have been long used by logicians to define the semantics of...
متن کاملStrategic Decompositions of Normal Form Games: Zero-sum Games and Potential Games
We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are “strategically equivalent” if, for every player, the payoff differences between two strategies (holding other players’ strategies fixed) are identical. A zero-sum equivalent game is a game that is st...
متن کاملExpressiveness and Complexity Results for Strategic Reasoning
Abstract This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on win...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017